#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n;
    cin >> n;

    V<V<int>> w(n + 1, V<int>(4, 0));

    FOR(j, 1, 3) {
        FOR(i, 1, n) {
            cin >> w[i][j];
        }
    }

    V<int> mx(4, 1);
    V<PII> pre(n + 1);
    string s = "qkj";

    FOR(i, 2, n) {
        bool f = false;
        FOR(j, 1, 3) {
            if (w[mx[j]][j] > w[i][j]) {
                f = 1;
                pre[i] = {j, mx[j]};
            }
        }
        if (f) {
            FOR(j, 1, 3) {
                if (w[mx[j]][j] < w[i][j]) mx[j] = i;
            }
        } else if (i == n) {
            NO;
            RE;
        }
    }
    YES;
    int t = n;
    V<pair<int, char>> ans;
    while (t != 1) {
        ans.pb({t, s[pre[t].fi - 1]});
        t = pre[t].se;
    }
    reverse(ALL(ans));
    cout << sz(ans) << endl;
    for (auto [x, y] : ans) cout << y << ' ' << x << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
